Formal and finite order equivalences
نویسندگان
چکیده
منابع مشابه
Formal and Finite Order Equivalences
We show that two families of germs of real-analytic subsets in Cn are formally equivalent if and only if they are equivalent of any finite order. We further apply the same technique to obtain analogous statements for equivalences of real-analytic self-maps and vector fields under conjugations. On the other hand, we provide an example of two sets of germs of smooth curves that are equivalent of ...
متن کاملNonaxiomatisability of Equivalences over Finite State Processes
This paper considers the existence of finite equational axiomatisations of behavioural equivalences over a calculus of finite state processes. To express even simple properties such as xE = xE[E=x] some notation for substitutions is required. Accordingly the calculus is embedded in a simply typed lambda calculus, allowing such schemas to be expressed as equations between terms containing first ...
متن کاملEquivalEncEs and calculi for formal vErification of cryptographic protocols
Security protocols are essential to the proper functioning of any distributed system running over an insecure network but often have flaws that can be exploited even without breaking the cryptography. Formal cryptography, the assumption that the cryptographic primitives are flawless, facilitates the construction of formal models and verification tools. Such models are often based on process cal...
متن کاملCore Higher-Order Session Processes: Tractable Equivalences and Relative Expressiveness
This work proposes tractable bisimulations for the higher-order πcalculus with session primitives (HOπ) and offers a complete study of the expressivity of its most significant subcalculi. First we develop three typed bisimulations, which are shown to coincide with contextual equivalence. These characterisations demonstrate that observing as inputs only a specific finite set of higher-order valu...
متن کاملBehavioural Equivalences on Finite-State Systems are PTIME-hard
The paper shows a logspace-reduction from the boolean circuit value problem which demonstrates that any relation subsuming bisimilarity and being subsumed by trace preorder (i.e., language inclusion) is ptime-hard, even for finite acyclic labelled transition systems. This reproves and substantially extends the result of Balcázar, Gabarró and Sántha (1992) for bisimilarity.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematische Zeitschrift
سال: 2010
ISSN: 0025-5874,1432-1823
DOI: 10.1007/s00209-010-0764-8